Odd-Rule Cellular Automata on the Square Grid Shalosh B. Ekhad C/o Doron Zeilberger Department of Mathematics Rutgers University (New Brunswick) Hill Center-Busch Campus, 110 Frelinghuysen Rd.

Source URL: neilsloane.com

• Mathematical analysis
• Mathematics
• Expected value
• Information theory
• Orthogonal polynomials
• Markov number
• Mutual information

Dresden University of Technology Institute for Theoretical Computer Science Chair for Automata Theory LTCS–Report

Source URL: lat.inf.tu-dresden.de

PDF Document

Source URL: highlights-conference.org

• Finite automata
• Theoretical computer science
• Mathematics
• Muller automaton
• Automata theory

lecture 03 sequential logic

Source URL: nand2tetris.org

• Sequential logic
• Electronics
• Flip-flop
• Digital electronics
• Electronic engineering
• Automata theory

Decreasing energy functions for some cellular automata E. Goles * Department of Mathematics Engineering School University of Chile

Source URL: www.dtc.umn.edu

• Combinatory logic
• Lambda calculus
• Logic in computer science
• Stochastic processes
• Estimation theory
• Heat equation
• Itō diffusion
• Statistics
• Mathematics
• Mathematical analysis

Dispensability of the randomization device in “Belief-free Equilibria in Repeated Games”, by Ely, Hörner and Olszewski (2004) ˚ denote its interior. Recall that V denotes the limit of the belief-free For B a subset

Source URL: faculty.wcas.northwestern.edu

Algorithms on Strings Maxime Crochemore Christophe Hancart Thierry Lecroq

Source URL: monge.univ-mlv.fr

• Combinatorics on words
• String
• String matching algorithms
• Automata theory
• Pattern matching
• Suffix array
• String searching algorithm
• Suffix tree
• Alphabet
• Formal languages
• Combinatorics
• Mathematics

On the topological complexity of weakly recognizable tree languages Jacques Duparc1 and Filip Murlak2? 1 Universit´e de Lausanne, Switzerland

Source URL: www.mimuw.edu.pl

• Mathematical logic
• Mathematics
• Omega language
• Tree
• Wadge hierarchy
• Determinacy
• Symbol
• Regular language
• Ω-automaton
• Automata theory
• Formal languages
• Theoretical computer science

On Pebble Automata for Data Languages with Decidable Emptiness Problem Tony Tan Department of Computer Science, Technion – Israel Institute of Technology School of Informatics, University of Edinburgh ni

Source URL: alpha.uhasselt.be

• Computer science
• Symbol
• Automata theory
• Theoretical computer science
• Pebble automaton

Delft University of Technology Software Engineering Research Group Technical Report Series Parse Table Composition Separate Compilation and Binary

Source URL: swerl.tudelft.nl

• Compiler construction
• Computing
• Parsing
• Automata theory
• Models of computation
• LR parser
• Formal grammar
• Parsing table
• Compiler-compiler
• Formal languages
• Programming language implementation
• Software engineering